Substructure Preconditioners for Elliptic Saddle Point Problems
نویسندگان
چکیده
منابع مشابه
Substructure Preconditioners for Elliptic Saddle Point Problems
Domain decomposition preconditioners for the linear systems arising from mixed finite element discretizations of second-order elliptic boundary value problems are proposed. The preconditioners are based on subproblems with either Neumann or Dirichlet boundary conditions on the interior boundary. The preconditioned systems have the same structure as the nonpreconditioned systems. In particular, ...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملAnalysis of Preconditioners for Saddle-Point Problems
Analysis of pre onditioners for saddle-point problems D. Loghin and A. J. Wathen Mixed nite element formulations give rise to large, sparse, blo k linear systems of equations the solution of whi h is often sought via a pre onditioned iterative te hnique. In this work we present a general analysis of blo kpre onditioners based on the stability onditions inherited from the formulation of the nite...
متن کاملPreconditioners for Generalized Saddle-Point Problems
We propose and examine block-diagonal preconditioners and variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. That is, we consider the nonsymmetric, nonsingular case where the (2,2) block is small in norm, and we are particularly concerned with the case where the (1,2) block is different from the transposed (2,1) block. We provide theoretical and exper...
متن کاملBlock LU Preconditioners for Symmetric and Nonsymmetric Saddle Point Problems
In this paper, a block LU preconditioner for saddle point problems is presented. The main diierence between the approach presented here and that of other studies is that an explicit, accurate approximation of the Schur complement matrix is eeciently computed. This is used to compute a preconditioner to the Schur complement matrix that in turn deenes a preconditioner for a global iteration. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1993
ISSN: 0025-5718
DOI: 10.2307/2153155